An Optimal Routing Strategy Based on Specifying Shortest Path

An Optimal Routing Strategy Based on Specifying Shortest Path

Unlike the shortest path is randomly chosen in the traditional shortest path routing strategy, a novel routing strategy to improve the network transportation capacity is proposed in this paper. According to the different characteristics of the nodes along actual paths, we specify the shortest paths of all pairs of nodes aiming at reducing the betweenness of those high-betweenness nodes. Simulat...

The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles

Multi Constraint Shortest Path Routing

Towards an Optimal Routing Strategy

The key features of the principal interior routing protocols for large systems are considered and compared, and the major weaknesses of the open standards noted. A proposal is given for an improved version (the Enhanced Routing Algorithm ERA) and implementation options discussed. The results of initial simulation testing are summarized and future directions suggested in conclusion.

Endhost-Based Shortest Path Routing in Dynamic Networks: Supporting Materials

Proof. The proof is based on a similar idea as in the proof of Theorem 3.1 in [2]: if we modify the link weights so that a competitive link becomes part of the optimal path and thus must be used most of the time by any good algorithm, then this link must be used sufficiently often (Ω(log T ) in T steps) by the same algorithm under the original link weights because we do not know which weight co...